Nonlocal infinity Laplacian equation on graphs with applications in image processing and machine learning
نویسندگان
چکیده
In this paper, an adaptation of the infinity Laplacian equation to weighted graphs is proposed. This adaptation leads to a nonlocal artial difference equation on graphs, which is an extension of the well-known approximations of the infinity Laplacian equation. o do so, we study the limit as p tends to infinity of minimizers of p-harmonic function on graphs. We also prove the existence and niqueness of the solution of this equation. Our motivation stems from the extension of the nonlocal infinity Laplacian equation rom image processing to machine learning fields, with proposed illustrations for image inpainting and semi-supervised clustering. 2014 IMACS. Published by Elsevier B.V. All rights reserved.
منابع مشابه
Non-Local Morphological PDEs and p-Laplacian Equation on Graphs With Applications in Image Processing and Machine Learning
In this paper, we introduce a new class of nonlocal p-Laplacian operators that interpolate between non-local Laplacian and infinity Laplacian. These operators are discrete analogous of the game p-laplacian operators on Euclidean spaces, and involve discrete morphological gradient on graphs. We study the Dirichlet problem associated with the new p-Laplacian equation and prove existence and uniqu...
متن کاملMathematical Morphology and Eikonal Equations on Graphs for Nonlocal Image and Data Processing
Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a novel formulation of MM formalized as a framework of partial difference equations (PdEs) over weighted graphs of arbitrary topology. Then, we pre...
متن کاملNonlocal Linear Image Regularization and Supervised Segmentation
A nonlocal quadratic functional of weighted differences is examined. The weights are based on image features and represent the affinity between different pixels in the image. By prescribing different formulas for the weights, one can generalize many local and nonlocal linear denoising algorithms, including the nonlocal means filter and the bilateral filter. In this framework one can easily show...
متن کاملEnhancement of Learning Based Image Matting Method with Different Background/Foreground Weights
The problem of accurate foreground estimation in images is called Image Matting. In image matting methods, a map is used as learning data, which is produced by those pixels that are definitely foreground, definitely background ,and unknown. This three-level pixel map is often referred to as a trimap, which is produced manually in alpha matte datasets. The true class of unknown pixels will be es...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 102 شماره
صفحات -
تاریخ انتشار 2014